Parallel Lempel Ziv Coding
نویسندگان
چکیده
We explore the possibility of using multiple processors to improve the encoding and decoding times of Lempel–Ziv schemes. A new layout of the processors, based on a full binary tree, is suggested and it is shown how LZSS and LZW can be adapted to take advantage of such parallel architectures. The layout is then generalized to higher order trees. Experimental results show an improvement in compression over the standard method of parallelization and an improvement in time over the sequential method. © 2004 Elsevier B.V. All rights reserved.
منابع مشابه
Parallel Lempel-Ziv-Welch (PLZW) Technique for Data Compression
Data Compression is one of the most fundamental problems in computer science and information technology. Many sequential algorithms are suggested for the problem. The most well known sequential algorithm is Lempel-ZivWelch (LZW) compression technique. The limitation of sequential algorithm is that ith block can be coded only after the (i-1)th block has completed. This limitation can be overcome...
متن کاملRedundancy estimates for the Lempel-Ziv algorithm of data compression
The problem of non-distorting compression (or coding) of sequences of symbols is considered. For sequences of asymptotically zero empirical entropy, a modi0cation of the Lempel–Ziv coding rule is o1ered whose coding cost is at most a 0nite number of times worse than the optimum. A combinatorial proof is o1ered for the well-known redundancy estimate of the Lempel–Ziv coding algorithm for sequenc...
متن کاملUniversal coding of nonstationary sources
In this correspondence we investigate the performance of the Lempel–Ziv incremental parsing scheme on nonstationary sources. We show that it achieves the best rate achievable by a finite-state block coder for the nonstationary source. We also show a similar result for a lossy coding scheme given by Yang and Kieffer which uses a Lempel–Ziv scheme to perform lossy coding.
متن کاملA Modified Lempel–ziv Welch Source Coding Algorithm for Efficient Data Compression
Lempel–Ziv Welch (LZW) algorithm is a well-known powerful data compression algorithm created by Abraham Lempel, Jacob Ziv, and Terry Welch. The algorithm is designed to be fast to implement but is not usually optimal because it performs only limited analysis of the data. A modified LZW algorithm on source coding will be proposed in this paper to improve the compression efficiency of the existin...
متن کاملUniversal Variable-to-Fixed Length Codes Achieving Optimum Large Deviations Performance for Empirical Compression Ratio
This paper clari es two variable-toxed length codes which achieve optimum large deviations performance of empirical compression ratio. One is Lempel-Ziv code with xed number of phrases, and the other is an arithmetic code with xed codeword length. It is shown that Lempel-Ziv code is asymptotically optimum in the above sense, for the class of nite-alphabet and nite-state sources, and that the ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 146 شماره
صفحات -
تاریخ انتشار 2001